Quantum Formulas: A Lower Bound and Simulation
نویسندگان
چکیده
منابع مشابه
Quantum Formulas: A Lower Bound and Simulation
We show that Nechiporuk’s method [26] for proving lower bounds for Boolean formulas can be extended to the quantum case. This leads to an Ω(n/ log n) lower bound for quantum formulas computing an explicit function. The only known previous explicit lower bound for quantum formulas [27] states that the majority function does not have a linear–size quantum formula. We also show that quantum formul...
متن کاملA Lower Bound for Quantum Phase Estimation
We obtain a query lower bound for quantum algorithms solving the phase estimation problem. Our analysis generalizes existing lower bound approaches to the case where the oracle Q is given by controlled powers Q of Q, as it is for example in Shor’s order finding algorithm. In this setting we will prove a Ω(log 1/ǫ) lower bound for the number of applications of Q1 , Q2 , . . .. This bound is tigh...
متن کاملQuantum lower bound for sorting ∗
Needless to say, sorting, especially sorting by comparisons, has been a classical problem in computer science. Despite its enormous importance, the complexity, in terms of the number of comparisons needed, is simple to analyze. Straightforward information theoretical argument gives the tight lower bound of log2(n!), which is achieved by several simple sorting algorithms, for example, Insertion ...
متن کاملAn Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas
Haken proved that every resolution refutation of the pigeon hole formula has at least exponential size. Groote and Zantema proved that a particular OBDD computation of the pigeon hole formula has an exponential size. Here we show that any arbitrary OBDD refutation of the pigeon hole formula has an exponential size, too: we prove that the size of one of the intermediate OBDDs is at least Ω(1.025).
متن کاملNew Lower Bound Formulas for Multicolored Ramsey Numbers
We give two lower bound formulas for multicolored Ramsey numbers. These formulas improve the bounds for several small multicolored Ramsey numbers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2001
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539700370965